8 research outputs found
Sensor Control for Multi-Object Tracking Using Labeled Multi-Bernoulli Filter
The recently developed labeled multi-Bernoulli (LMB) filter uses better
approximations in its update step, compared to the unlabeled multi-Bernoulli
filters, and more importantly, it provides us with not only the estimates for
the number of targets and their states, but also with labels for existing
tracks. This paper presents a novel sensor-control method to be used for
optimal multi-target tracking within the LMB filter. The proposed method uses a
task-driven cost function in which both the state estimation errors and
cardinality estimation errors are taken into consideration. Simulation results
demonstrate that the proposed method can successfully guide a mobile sensor in
a challenging multi-target tracking scenario
Multi-Bernoulli Sensor-Control via Minimization of Expected Estimation Errors
This paper presents a sensor-control method for choosing the best next state
of the sensor(s), that provide(s) accurate estimation results in a multi-target
tracking application. The proposed solution is formulated for a multi-Bernoulli
filter and works via minimization of a new estimation error-based cost
function. Simulation results demonstrate that the proposed method can
outperform the state-of-the-art methods in terms of computation time and
robustness to clutter while delivering similar accuracy
Information theoretic approach to robust multi-Bernoulli sensor control
A novel sensor control solution is presented, formulated within a
Multi-Bernoulli-based multi-target tracking framework. The proposed method is
especially designed for the general multi-target tracking case, where no prior
knowledge of the clutter distribution or the probability of detection profile
are available. In an information theoretic approach, our method makes use of
R\`{e}nyi divergence as the reward function to be maximized for finding the
optimal sensor control command at each step. We devise a Monte Carlo sampling
method for computation of the reward. Simulation results demonstrate successful
performance of the proposed method in a challenging scenario involving five
targets maneuvering in a relatively uncertain space with unknown
distance-dependent clutter rate and probability of detection
A Review on Map-Merging Methods for Typical Map Types in Multiple-Ground-Robot SLAM Solutions
When multiple robots are involved in the process of simultaneous localization and mapping (SLAM), a global map should be constructed by merging the local maps built by individual robots, so as to provide a better representation of the environment. Hence, the map-merging methods play a crucial rule in multi-robot systems and determine the performance of multi-robot SLAM. This paper looks into the key problem of map merging for multiple-ground-robot SLAM and reviews the typical map-merging methods for several important types of maps in SLAM applications: occupancy grid maps, feature-based maps, and topological maps. These map-merging approaches are classified based on their working mechanism or the type of features they deal with. The concepts and characteristics of these map-merging methods are elaborated in this review. The contents summarized in this paper provide insights and guidance for future multiple-ground-robot SLAM solutions